2-Adic Complexity of a Sequence Obtained from a Periodic Binary Sequence by Either Inserting or Deleting k Symbols within One Period
نویسندگان
چکیده
In this paper, we propose a method to get the lower bounds of the 2-adic complexity of a sequence obtained from a periodic sequence over by either inserting or deleting symbols within one period. The results show the variation of the distribution of the 2-adic complexity becomes as increases. Particularly, we discuss the lower bounds when respectively. k (2) GF
منابع مشابه
Computing the k-error 2-adic complexity of a binary sequence of period p
Cryptographically strong sequences should have a large 2-adic complexity to thwart the known feedback with carry shift register (FCSR) synthesis algorithms. At the same time the change of a few terms should not cause a significant decrease of the 2-adic complexity. This requirement leads to the concept of the k-error 2-adic complexity. In this paper, an algorithm for computing the k-error 2-adi...
متن کاملSeismic Data Forecasting: A Sequence Prediction or a Sequence Recognition Task
In this paper, we have tried to predict earthquake events in a cluster of seismic data on pacific ring of fire, using multivariate adaptive regression splines (MARS). The model is employed as either a predictor for a sequence prediction task, or a binary classifier for a sequence recognition problem, which could alternatively help to predict an event. Here, we explain that sequence prediction/r...
متن کاملar X iv : 1 10 8 . 57 93 v 1 [ cs . C R ] 3 0 A ug 2 01 1 The k - error linear complexity distribution for 2 n - periodic binary sequences
The linear complexity and the k-error linear complexity of a sequence have been used as important security measures for key stream sequence strength in linear feedback shift register design. By studying the linear complexity of binary sequences with period 2n, one could convert the computation of kerror linear complexity into finding error sequences with minimal Hamming weight. Based on Games-C...
متن کاملThe $$k$$ -error linear complexity distribution for $$2^n$$ -periodic binary sequences
The linear complexity and the k-error linear complexity of a sequence have been used as important security measures for key stream sequence strength in linear feedback shift register design. By studying the linear complexity of binary sequences with period 2n, one could convert the computation of kerror linear complexity into finding error sequences with minimal Hamming weight. Based on Games-C...
متن کاملOn the $k$-error linear complexity for $2^n$-periodic binary sequences via Cube Theory
The linear complexity and k-error linear complexity of a sequence have been used as important measures of keystream strength, hence designing a sequence with high linear complexity and k-error linear complexity is a popular research topic in cryptography. In this paper, the concept of stable k-error linear complexity is proposed to study sequences with stable and large k-error linear complexity...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2008 شماره
صفحات -
تاریخ انتشار 2008